Better Bounds for Coalescing-Branching Random Walks
نویسندگان
چکیده
منابع مشابه
Mean field conditions for coalescing random walks
The main results in this paper are about the full coalescence time C of a system of coalescing random walks over a finite graph G. Letting m(G) denote the mean meeting time of two such walkers, we give sufficient conditions under which E [C] ≈ 2m(G) and C/m(G) has approximatelly the same law as in the “mean field” setting of a large complete graph. One of our theorems is that mean field behavio...
متن کاملBranching Random Walks
We study a generalized branching random walk where particles breed at a rate which depends on the number of neighbouring particles. Under general assumptions on the breeding rates we prove the existence of a phase where the population survives without exploding. We construct a non trivial invariant measure for this case.
متن کاملAsymptotic properties of coalescing random walks
A Coalescing random walk is an interacting particle system which can be described as the following. Suppose that there is one particle located at each integer position [0, n] at time point 0 and that a particle is chosen at random at any time point t among the remaining in [1, n] and moves one step in some direction, where the direction can be deterministic or stochastic. The particle coalesce ...
متن کاملBranching Random Walks on Graphs
We study a new distributed randomized information propagation mechanism in networks that we call a branching random walk (BRW). BRW is a generalization of the well-studied “standard” random walk which is a fundamental primitive useful in a wide variety of network applications ranging from token management and load balancing to search, routing, information propagation and gossip. BRW is paramete...
متن کاملMinima in Branching Random Walks
Given a branching random walk, let Mn be the minimum position of any member of the n’th generation. We calculate EMn to within O(1) and prove exponential tail bounds for P {|Mn − EMn| > x}, under quite general conditions on the branching random walk. In particular, together with work of [8], our results fully characterize the possible behavior of EMn when the branching random walk has bounded b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Parallel Computing
سال: 2018
ISSN: 2329-4949,2329-4957
DOI: 10.1145/3209688